LVB: parsimony and simulated annealing in the search for phylogenetic trees
نویسنده
چکیده
UNLABELLED The program LVB seeks parsimonious phylogenies from nucleotide alignments, using the simulated annealing heuristic. LVB runs fast and gives high quality results. AVAILABILITY The software is available at http://www.rubic.reading.ac.uk/lvb/ SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION may be downloaded from http://www.rubic.reading.ac.uk/~daniel/
منابع مشابه
Maximum Parsimony Phylogenetic Inference Using Simulated Annealing
The Maximum Parsimony (MP) problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the total number of genetic transformations. In this paper we propose a carefully devised simulated annealing implementation, called SAMPARS (Simulated Annealing for Maximum PARSimony), for finding near-optimal solutions for the MP problem. Different possibilities for its key compon...
متن کاملStochastic search strategy for estimation of maximum likelihood phylogenetic trees.
The maximum likelihood (ML) method of phylogenetic tree construction is not as widely used as other tree construction methods (e.g., parsimony, neighbor-joining) because of the prohibitive amount of time required to find the ML tree when the number of sequences under consideration is large. To overcome this difficulty, we propose a stochastic search strategy for estimation of the ML tree that i...
متن کاملComparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملOn simulated annealing phase transitions in phylogeny reconstruction
Phylogeny reconstruction with global criteria is NP-complete or NP-hard, hence in general requires a heuristic search. We investigate the powerful, physically inspired, general-purpose heuristic simulated annealing, applied to phylogeny reconstruction. Simulated annealing mimics the physical process of annealing, where a liquid is gently cooled to form a crystal. During the search, periods of e...
متن کاملMorphological phylogenetic analysis of the genera Fragaria and Duchesnea in Iran
In this research phylogenetic relationships of the two genera Fragaria and Duchesnea, including four species ( Fragaria viridis, F. vesca, Duchesnea indica and D. chrysantha) and 2 of their closely related species (Potentilla reptans and P. micrantha) plus 2 Fillipendulla species ( representing outgroups) were carried out using morphological traits. Primarily, morphological evidences of 30 taxa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bioinformatics
دوره 20 2 شماره
صفحات -
تاریخ انتشار 2004